Minimax AUC Fairness: Efficient Algorithm with Provable Convergence
نویسندگان
چکیده
The use of machine learning models in consequential decision making often exacerbates societal inequity, particular yielding disparate impact on members marginalized groups defined by race and gender. area under the ROC curve (AUC) is widely used to evaluate performance a scoring function learning, but studied algorithmic fairness less than other metrics. Due pairwise nature AUC, defining an AUC-based group metric pairwise-dependent may involve both intra-group inter-group AUCs. Importantly, considering only one category AUCs not sufficient mitigate unfairness AUC optimization. In this paper, we propose minimax bias mitigation framework that incorporates while maintaining utility. Based Rawlsian framework, design efficient stochastic optimization algorithm prove its convergence minimum group-level AUC. We conduct numerical experiments synthetic real-world datasets validate effectiveness proposed algorithm.
منابع مشابه
Efficient AUC Maximization with Regularized Least-Squares
Area under the receiver operating characteristics curve (AUC) is a popular measure for evaluating the quality of binary classifiers, and intuitively, machine learning algorithms that maximize an approximation of AUC should have a good AUC performance when classifying new examples. However, designing such algorithms in the framework of kernel methods has proven to be challenging. In this paper, ...
متن کاملEfficient AUC Optimization for Classification
In this paper we show an efficient method for inducing classifiers that directly optimize the area under the ROC curve. Recently, AUC gained importance in the classification community as a mean to compare the performance of classifiers. Because most classification methods do not optimize this measure directly, several classification learning methods are emerging that directly optimize the AUC. ...
متن کاملEfficient Steganography with Provable Security Guarantees
We provide a new provably-secure steganographic encryption protocol that is proven secure in the complexity-theoretic framework of Hopper et al. The fundamental building block of our steganographic encryption protocol is a “one-time stegosystem” that allows two parties to transmit one-time steganographic messages of length shorter than the shared key with information-theoretic security guarante...
متن کاملEfficient Distributed Topic Modeling with Provable Guarantees
Topic modeling for large-scale distributed web-collections requires distributed techniques that account for both computational and communication costs. We consider topic modeling under the separability assumption and develop novel computationally efficient methods that provably achieve the statistical performance of the state-of-the-art centralized approaches while requiring insignificant commu...
متن کاملEfficient AUC Learning Curve Calculation
A learning curve of a performance measure provides a graphical method with many benefits for judging classifier properties. The area under the ROC curve (AUC) is a useful and increasingly popular performance measure. In this paper, we consider the computational aspects of calculating AUC learning curves. A new method is provided for incrementally updating exact AUC curves and for calculating ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i10.26405